Scheduling a deteriorating maintenance activity and due-window assignment

نویسندگان

  • Baruch Mor
  • Gur Mosheiov
چکیده

Several papers published during the last decade dealt with scheduling a maintenance activity and considered a new setting, where the maintenance duration is assumed to be deteriorating, i.e., it requires more time or effort if it is delayed. We study a deteriorating maintenance in the context of due-window assignment, where a time interval is determined such that jobs completed within this interval are “ontime”, whereas early and tardy jobs are penalized. Thus, our paper extends known models by considering simultaneously a deteriorating maintenance and due-window. Two deterioration types are considered: time-dependent (where the maintenance time increases as a function of its starting time), and position-dependent (where it is a function of its position in the sequence). The classical assumption of position-independent processing times was considered first, and then the model is extended to general position-dependent processing times. We prove several properties of the optimal timing of the duewindow and of the maintenance. Consequently, we show that all the problems studied here are solved in Oðn4Þ, where n is the number of jobs. & 2014 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single machine slack due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity

In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The cost for each job consists of four components: earliness, tardiness, window location and window size. The objective is to schedule the jobs and to assign the maintenance activity and due-windows s...

متن کامل

Common due-window assignment and scheduling on a single machine with past-sequence-dependent set up times and a maintenance activity

This study investigates the single-machine scheduling problem with common due-win -dow assignment, past-sequence-dependent (p-s-d) setup times and a deteriorating maintenance activity. By past-sequence-dependent setup times, we mean that the setup time of a job is proportional to the sum of the processing times of the jobs already processed. The objective is to minimize a cost function based on...

متن کامل

Single-Machine Scheduling with Due-Date Assignment and Aging Effect under a Deteriorating Maintenance Activity Consideration

This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating maintenance activity consideration simultaneously. The maintenance activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the maintenance activity has been co...

متن کامل

Note on "Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity"

Article history: Received 19 November 2012 Received in revised form 8 May 2013 Accepted 22 August 2013 Available online 31 August 2013

متن کامل

A new approach for constraining failure probability of a critical deteriorating system Yard crane scheduling in port container terminals using genetic algorithm

In this paper, we focus on a continuously deteriorating critical equipment which its failure cannot be measured by cost criterion. For these types of systems like military systems, nuclear systems, etc it is extremely important to avoid failure during the actual operation of the system. In this paper we propose an approach which constrains failure probability to a pre-specified value. This valu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2015